The Maximum Degree of Series-Parallel Graphs
نویسندگان
چکیده
منابع مشابه
The Maximum Degree of Series-Parallel Graphs
MICHAEL DRMOTA, OMER GIMÉNEZ and MARC NOY Combinatorics, Probability and Computing / Volume 20 / Issue 04 / July 2011, pp 529 570 DOI: 10.1017/S0963548311000198, Published online: 31 May 2011 Link to this article: http://journals.cambridge.org/abstract_S0963548311000198 How to cite this article: MICHAEL DRMOTA, OMER GIMÉNEZ and MARC NOY (2011). The Maximum Degree of Series Parallel Graphs. C...
متن کاملThe maximum degree of planar graphs I. Series-parallel graphs
We prove that the maximum degree ∆n of a random series-parallel graph with n vertices satisfies ∆n/ log n → c in probability, and E∆n ∼ c log n for a computable constant c > 0. The same result holds for outerplanar graphs.
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملVertices of given degree in series-parallel graphs
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proportional to n, and quadratic exponential tail estimates. We further prove a corresponding theorem for the number of nodes of degree two in labelled planar graphs. The proof method is based on generating functions and sin...
متن کاملOn Maximum Common Subgraph Problems in Series-Parallel Graphs
The complexity of the maximum common connected subgraph problem in partial k-trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial 2-trees. On the contrary, the problem is known to be NP-hard in vertex-labeled partial 11-trees of bounded degree. We consider series-parallel graphs, i.e., partial 2-trees. We show ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2011
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548311000198